Back to course home
0% completed
Vote For New Content
Oracle Medium
Longest Palindromic Substring (medium)
Solution: Longest Palindromic Substring
Single Element in a Sorted Array (medium)
Solution: Single Element in a Sorted Array
Pairs of Songs With Total Durations Divisible by 60 (medium)
Solution: Pairs of Songs With Total Durations Divisible by 60
Search a 2D Matrix II (medium)
Solution: Search a 2D Matrix II
Minimize Maximum of Array (medium)
Solution: Minimize Maximum of Array
Asteroid Collision (medium)
Solution: Asteroid Collision
Combination Sum (medium)
Solution: Combination Sum
Binary Tree Right Side View (medium)
Solution: Binary Tree Right Side View
Sort Colors (medium)
Solution: Sort Colors
Group Anagrams (Medium)
Solution: Group Anagrams
Decode String (Medium)
Solution: Decode String
Number of Islands (medium)
Solution: Number of Islands
Binary Tree Zigzag Level Order Traversal (medium)
Solution: Binary Tree Zigzag Level Order Traversal
Longest Common Subsequence (medium)
Solution: Longest Common Subsequence
Rotting Oranges (medium)
Solution: Rotting Oranges
Meeting Rooms II (medium)
Solution: Meeting Rooms II
Delete Node in a BST (medium)
Solution: Delete Node in a BST
Remove Duplicate Letters (medium)
Solution: Remove Duplicate Letters
Longest Substring Without Repeating Characters (medium)
Solution: Longest Substring Without Repeating Characters (medium)
Search in Rotated Array (medium)
Solution: Search in Rotated Array
Spiral Matrix (medium)
Solution: Spiral Matrix
Container With Most Water (Medium)
Solution: Container With Most Water
3Sum (medium)
Solution: 3Sum
Simplify Path (medium)
Solution: Simplify Path
Next Permutation (medium)
Solution: Next Permutation
Basic Calculator II (medium)
Solution: Basic Calculator II
Merge Intervals (medium)
Solution: Merge Intervals
Restore IP Addresses (medium)
Solution: Restore IP Addresses
Longest Increasing Subsequence (medium)
Solution: Longest Increasing Subsequence
Validate Binary Search Tree (medium)
Solution: Validate Binary Search Tree
Oracle Hard
Integer to English Words (hard)
Solution: Integer to English Words
Trapping Rain Water (hard)
Solution: Trapping Rain Water
First Missing Positive (hard)
Solution: First Missing Positive
Merge K Sorted Lists (hard)
Solution: Merge K Sorted Lists
Max Points on a Line (hard)
Solution: Max Points on a Line
Sudoku Solver (hard)
Solution: Sudoku Solver
Longest Valid Parentheses (hard)
Solution: Longest Valid Parentheses
Remove Nth Node From End of List (Medium)
Solution: Remove Nth Node From End of List
Median of Two Sorted Arrays (hard)
Solution: Median of Two Sorted Arrays
Constrained Subsequence Sum (hard)
Solution: Constrained Subsequence Sum
Degree of an Array (easy)
Problem Statement
You are given an array nums containing positive integers. The degree of nums is defined as the maximum frequency of any one of its elements.
Return the minimum length of a contiguous subarray of nums, that has the same degree as nums.
Example
-
Example 1:
- Input: nums =
[1, 4, 2, 3, 2] - Expected Output:
3 - Justification: The array's degree is 2 as it appears twice. The shortest subarray with a degree of 2 is
[2, 3, 2], which has a length of 3.
- Input: nums =
-
Example 2:
- Input: nums =
[4, 9, 4, 4, 5, 5, 4] - Expected Output:
7 - Justification: Here, the number 4 appears the most (four times). The shortest contiguous segment that includes four 4s is the array itself. So, the answer is
4.
- Input: nums =
-
Example 3:
- Input: nums =
[6, 1, 1, 2, 1, 2, 2] - Expected Output:
4 - Justification: The number 1 appears the most (three times). The shortest subarray capturing all instances of 1 is
[1, 1, 2, 1], which has a length of4.
- Input: nums =
Try it yourself
Try solving this question here:
Java
. . . .
Solution: Count Number of Pairs With Absolute Difference K
Solution: Degree of an Array
Mark as Completed
On this page
Problem Statement
Example
Try it yourself